Estimating the four parameters of the Burr III distribution using a hybrid method of variable neighborhood search and iterated local search algorithms

نویسندگان

  • Nima Zoraghi
  • Babak Abbasi
  • Seyed Taghi Akhavan Niaki
  • Mehrzad Abdi Khalife
چکیده

The Burr III distribution properly approximates many familiar distributions such as Normal, Lognormal, Gamma, Weibull, and Exponential distributions. It plays an important role in reliability engineering, statistical quality control, and risk analysis models. The Burr III distribution has four parameters known as location, scale, and two shape parameters. The estimation process of these parameters is controversial and puts a halt in front of statistical data analyzers. Although the maximum likelihood estimation (MLE) is understood as a straightforward method in parameters estimation, using MLE to estimate the Burr III parameters leads to maximize a complicated function with four unknown variables, where using a conventional optimization such as the gradient method is difficult. In this paper to circumvent the difficulty of maximizing the Burr III likelihood function, a meta-heuristics hybrid approach is proposed to estimate the unknown parameters. The hybrid approach composes of a variable neighborhood search (VNS) along with an iterated local search (ILS) algorithm to take part in the MLE method. In the proposed algorithm, different heuristic local search methods are investigated to promote the ILS algorithm performance. Furthermore, the Taguchi approach is employed to tune the parameters. The results of some numerical examples and simulation study indicate satisfactory performance of the proposed methodology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem

In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...

متن کامل

Modeling and scheduling no-idle hybrid flow shop problems

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

Lot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors

This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...

متن کامل

A Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network

Abstract   Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 218  شماره 

صفحات  -

تاریخ انتشار 2012